Program Synthesis in Saturation

Abstract We present an automated reasoning framework for synthesizing recursion-free programs using saturation-based theorem proving. Given a functional specification encoded as first-order logical formula, we use prover to both establish validity of this formula and discover program fragments satisfying the specification. As result, when deriving proof correctness, also synthesize that is correct with respect given describe properties calculus capable synthesis should employ, extend superposition in corresponding way. implemented our work Vampire , extending successful applicability proving synthesis.